Solving 3D Geometric Constraints for Assembly Modelling

نویسندگان

  • J. Kim
  • K. Kim
  • K. Choi
  • J. Y. Lee
چکیده

A geometric constraint solving method is presented that takes well-constrained mating conditions between a base and a mating component and directly transforms them into a 4 × 4 matrix that determines the relative orientation and location of the mating component with respect to the base component. In the proposed procedure, the 4 × 4 transformation matrix is determined by directly computing a rotation matrix TR and a translation matrix TL that define the relative orientation and location of the mating component, respectively. Thus, first, the rotation matrix is computed by solving a set of linear constraint equations associated with the orientation of two mating components. After repositioning the mating component by applying the rotation matrix TR, the translation matrix is calculated by solving a set of linear constraint equations associated with location. This new method is computationally very effective, since the transformation matrix for relative orientation and location of the mating component is algebraically derived directly from the linear equations associated with the mating conditions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving 3d Geometric Constraints for Closed-loop Assemblies

In the design activity, part geometry is assembled together to create an assembly model. The number of parts can range from a few tens to a few millions and typically the relationships among them construct a closed-loop with under-constrained states in a constraint graph. In this paper, we propose an efficient and robust 3D constraint solving method for determining part positions in closed-loop...

متن کامل

Using Geometric Constraints for Camera Calibration and Positioning and 3d Scene Modelling

This work concerns the incorporation of geometric information in camera calibration and 3D modelling. Using geometric constraints enables stabler results and allows to perform tasks with fewer images. Our approach is interactive; the user defines geometric primitives and constraints between them. It is based on the observation that constraints such as coplanarity, parallelism or orthogonality, ...

متن کامل

Target detection Bridge Modelling using Point Cloud Segmentation Obtained from Photogrameric UAV

In recent years, great efforts have been made to generate 3D models of urban structures in photogrammetry and remote sensing. 3D reconstruction of the bridge, as one of the most important urban structures in transportation systems, has been neglected because of its geometric and structural complexity. Due to the UAV technology development in spatial data acquisition, in this study, the point cl...

متن کامل

Gpdof - a Fast Algorithm to Decompose under-constrained Geometric Constraint Systems: Application to 3d Modeling

Our approach exploits a general-purpose decomposition algorithm, called GPDOF, and a dictionary of very efficient solving procedures, called r-methods, based on theorems of geometry. GPDOF decomposes an equation system into a sequence of small subsystems solved by r-methods, and produces a set of input parameters. Recursive assembly methods (decomposition-recombination), maximum matching based ...

متن کامل

A non-rigid cluster rewriting approach to solve systems of 3D geometric constraints

We present a new constructive solving approach for systems of 3D geometric constraints. The solver is based on the cluster rewriting approach, which can efficiently solve large systems of constraints on points, and incrementally handle changes to a system, but can so far solve only a limited class of problems. The new solving approach extends the class of problems that can be solved, while reta...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000